Branch and Bound Implementations for the Traveling Salesperson Problem - Part 1: A solution with nodes containing partial tours with constraints
نویسنده
چکیده
منابع مشابه
Branch and Bound Implementations of the Traveling Salesperson Problem - Part 4: Distributed processing solution using RMI
The multi-threaded implementation presented in the previous column (July/August, 2003) sets the stage for the distributed processing implementation to be presented in this column. Please see the previous two columns for the details regarding the TSP best-first branch and bound algorithm that forms the basis for the work that shall be described in this column. Class Node is unchanged from the si...
متن کاملBranch and Bound Implementations for the Traveling Salesperson Problem - Part 2: Single threaded solution with many inexpensive nodes
The multi-threaded implementation presented in this column sets the stage for the distributed processing implementation to be presented in the next column. In the previous column a best-first branch and bound algorithm was introduced and implemented. This algorithm forms the basis for the current work (please review the details of that algorithm before continuing with this paper). Class Node is...
متن کاملA Development and Deployment Framework for Distributed Branch & Bound
Branch-and-bound intelligently searches the set of feasible solutions to a combinatorial optimization problem: It, in effect, proves that the optimal solution is found without necessarily examining all feasible solutions. The feasible solutions are not given. They can be generated from the problem description. However, doing so usually is computationally infeasible: The number of feasible solut...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملMULTI-OBJECTIVE OPTIMIZATION WITH PREEMPTIVE PRIORITY SUBJECT TO FUZZY RELATION EQUATION CONSTRAINTS
This paper studies a new multi-objective fuzzy optimization prob- lem. The objective function of this study has dierent levels. Therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. Since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. We study this problem and determine some special structures related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Object Technology
دوره 2 شماره
صفحات -
تاریخ انتشار 2003